Automatic Test Generation for N-Way Combinatorial Testing

نویسندگان

  • Changhai Nie
  • Baowen Xu
  • Liang Shi
  • Guowei Dong
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

متن کامل

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers...

متن کامل

Combinatorial Test Case Suite Generation Based on Differential Evolution Algorithm

The combinatorial testing, an effective way to improve the efficiency of software testing, is an important means to ensure the quality of software. In the combinatorial testing, the key is the combinatorial test case suite generation. According to the characteristics of the combinatorial test case suite generation problem, this paper proposes a differential evolution algorithm based on the one-...

متن کامل

Anatomy of the Tree Based Strategy for High Strength Interaction Testing

The amount of resources consumed for a complete and exhaustive testing becomes unreasonable and unaffordable. While it is vital to assure the quality and the reliability of any system, it is impossible to do an exhaustive testing due to the huge number of possible combinations. To bring a balance between exhaustive testing and lack of testing combinatorial interactions testing has been adopted....

متن کامل

Anatomy of the Parallel Tree Based Strategy for High Strength Interaction Testing

Software and hardware testers concentrate on how to minimize the time involved in testing at the same time to ensure that the system is also tested well and made acceptable. This paper has enhanced and explained in details our previous strategy “A Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing” to work effectively in parallel and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005